Niching and Elitist Models for MOGAs
نویسندگان
چکیده
This paper examines several niching and elitist models applied to Multiple-Objective Genetic Algorithms (MOGAs). Test cases consider a simple problem as well as multidisciplinary design optimization of wing planform shape. Numerical results suggest that the combination of the fitness sharing and the best-N selection leads to the best performance.
منابع مشابه
Multidisciplinary Design Optimization of Aircraft Wing Planform Based on Evolutionary Algorithms
This paper examines the evolutionary approach for aircraft design optimization. Several niching and elitist models are first applied to Multiple-Objective Genetic Algorithms (MOGAs). Numerical results suggest that the combination of the fitness sharing and the best-N selection leads to the best performance. The resulting MOGA is then applied to multidisciplinary design optimization problems of ...
متن کاملDesigning A New Elitist Nondominated Sorted Genetic Algorithm For A Multiobjective Long Term Groundwater Monitoring Application
Although usage of genetic algorithms (GAs) has become widespread, the theoretical work from the genetic and evolutionary computation (GEC) field has been largely ignored by practitioners in realworld applications. This paper provides an overview of a three-step method for utilizing GEC theory to ensure robust search and avoid the common pitfalls in GA applications. Additionally, this study pres...
متن کاملA Case Study of a Multiobjective Elitist Recombinative Genetic Algorithm with Coevolutionary Sharing
We present a multiobjective genetic algorithm that incorporates various genetic algorithm techniques that have been proven to be efficient and robust in their problem domain. More specifically, we integrate rank based selection, adaptive niching through coevolutionary sharing, elitist recombination, and non-dominated sorting into a multiobjective genetic algorithm called ERMOCS. As a proof of c...
متن کاملA multiobjective approach to cost effective long-term groundwater monitoring using an elitist nondominated sorted genetic algorithm with historical data
This study presents a methodology for quantifying the tradeoffs between sampling costs and local concentration estimation errors in an existing groundwater monitoring network. The method utilizes historical data at a single snapshot in time to identify potential spatial redundancies within a monitoring network. Spatially redundant points are defined to be monitoring locations that do not apprec...
متن کاملA Clearing Procedure as a Niching Method for Genetic Algorithms
The clearing procedure is a niching method inspired by the principle stated by J.H. Holland in 1975: the sharing of limited resources within subpopulations of individuals characterized by some similarities. But, instead of evenly sharing the available resources among the individuals of a subpopulation, the clearing procedure supplies these resources only to the best individuals of each subpopul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998